Quasiconvex constrained multicriteria continuous location problems: Structure of nondominated solution sets
نویسندگان
چکیده
In this paper, we consider constrained multicriteria continuous location problems in two-dimensional spaces. In the literature, the continuous multicriteria location problem in two-dimensional spaces has received special attention in the last years, although only particular instances of convex functions have been considered. Our approach only requires the functions to be strictly quasiconvex and inf-compact. We obtain a geometrical description that provides a unified approach to handle multicriteria location models in two-dimensional spaces which has been implemented in MATHEMATICA. 2006 Elsevier Ltd. All rights reserved.
منابع مشابه
A Partition-Based Interactive Algorithm for Solving Multicriteria Linear Integer Programming Problems*
We propose a learning-oriented interactive algorithm for solving multicriteria linear integer programming (MCLIP) problems, considered as multicriteria decision making problems. At each iteration, the DM may partition the criteria set into at most seven classes, namely: improvement, improvement by a desired amount, deterioration, deterioration by at most a certain amount, nondeterioration, chan...
متن کاملA User-Friendly Interactive Algorithm of the Multicriteria Linear Integer Programming
The interactive algorithms are often used [2] to solve multicriteria linear integer programming problems (MCIP). These algorithms [3, 6, 7, 11, 13] are modifications of interactive approaches solving multicriteria linear problems that include the integrality constraints. Linear integer programming problems are used as scalarizing problems in these interactive algorithms. These problems are NP-d...
متن کاملIntegrating Approximation and Interactive Decision Making in Multicriteria Optimization
We present a new interactive hybrid approach for solving multicriteria optimization problems where features of approximation methods and interactive approaches are incorporated. We produce rough approximations of the nondominated set and let the decision maker indicate with the help of reference points where to refine the approximation. In this way, (s)he iteratively directs the search towards ...
متن کاملProximal Point Methods for Functions Involving Lojasiewicz, Quasiconvex and Convex Properties on Hadamard Manifolds
This paper extends the full convergence of the proximal point method with Riemannian, Semi-Bregman and Bregman distances to solve minimization problems on Hadamard manifolds. For the unconstrained problem, under the assumptions that the optimal set is nonempty and the objective function is continuous and either quasiconvex or satisfies a generalized Lojasiewicz property, we prove the full conve...
متن کاملExplicitly quasiconvex optimization problems
We present some properties of explicitly quasiconvex functions, which play an important role in both multicriteria and scalar optimization. Some of these results were recently obtained together with Ovidiu Bagdasar during a research visit at the University of Derby (UK), within the project
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & OR
دوره 35 شماره
صفحات -
تاریخ انتشار 2008